Forward Human Reasoning Modeled by Logic Programming Modeled by Classical Logic with Circumscription and Projection

نویسنده

  • Christoph Wernhard
چکیده

Recently an approach to model human reasoning as studied in cognitive science by logic programming, has been introduced by Stenning and van Lambalgen and exemplified with the suppression task. We investigate this approach from the view of a framework where different logic programming semantics correspond to different translations of logic programs into formulas of classical two-valued logic extended by two second-order operators, circumscription and literal projection. Based on combining and extending previously known such renderings of logic programming semantics, we take semantics into account that have not yet been considered in the context of human reasoning, such as stable models and partial stable models. To model human reasoning, it is essential that only some predicates can be subjected to closed world reasoning, while others are handled by open world reasoning. In our framework, variants of familiar logic programing semantics that are extended with this feature are derived from a generic circumscription based representation. Further, we develop a two-valued representation of a three-valued logic that renders semantics considered for human reasoning based on the Fitting operator.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Abduction in Logic Programming as Second-Order Quantifier Elimination

It is known that skeptical abductive explanations with respect to classical logic can be characterized semantically in a natural way as formulas with second-order quantifiers. Computing explanations is then just elimination of the second-order quantifiers. By using application patterns and generalizations of second-order quantification, like literal projection, the globally weakest sufficient c...

متن کامل

Literal Projection and Circumscription

We develop a formal framework intended as a preliminary step for a single knowledge representation system that provides different representation techniques in a unified way. In particular we consider first-order logic extended by techniques for second-order quantifier elimination and non-monotonic reasoning. Background of the work is literal projection, a generalization of second-order quantifi...

متن کامل

Circumscribing Embedded Implications (without Stratications) Special Issue on Logic Programming and Nonmonotonic Reasoning

This paper is a study of circumscription, not in classical logic, as usual, but in intuitionistic logic. We rst review the intuitionistic circumscription of Horn clause logic programs, which was discussed in previous work, and we then consider the larger class of embedded implications. The ordinary circumscription axiom turns out to be inappropriate for this class of rules, and we analyze two a...

متن کامل

Nurse rostering using fuzzy logic: A case study

In this paper, we used the fuzzy set theory for modeling flexible constraints and uncertain data in nurse scheduling problems and proposed a fuzzy linear model for nurse rostering problems. The developed model can produce rosters that satisfy hospital objectives, ward requirements and staff preferences by satisfying their requests as much as possible. Fuzzy sets are used for modeling demands of...

متن کامل

Classical Logic Event Calculus as Answer Set Programming

Recently, Ferraris, Lee and Lifschitz presented a generalized definition of a stable model that applies to the syntax of arbitrary firstorder sentences, under which a logic program is viewed as a special class of first-order sentences. The new definition of a stable model is similar to the definition of circumscription, and can even be characterized in terms of circumscription. In this paper, w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011